Image registration using robust M-estimators
نویسندگان
چکیده
منابع مشابه
Image registration using robust M-estimators
In this paper, a method for robust image registration based on M-estimator Correlation Coefficient (MCC) is presented. A real valued correlation mask function is computed using Huber and Tukey’s robust statistics and is used as a similarity measure for registering image windows. The mask function suppresses the influence of outlier points and makes the registration algorithm robust to noisy pix...
متن کاملImage registration using robust correlation
We have investigated an intensity-based image registration technique using a robust correlation coefficient as a similarity measure. The proposed method has an advantage over the ordinary correlation coefficient since it reduces the effect of “outlier” image intensity values. For the application of image registration to radiotherapy or image-guided surgery, there may be outlier samples due to t...
متن کاملRobust Image Registration Using Selective Correlation Coefficient
\Ve propose a new method for robust image registrat,ion called 'Selective Correlation Coefficient (SCC)' in order to search images under illconditioned illuminat,ion or partial occlusion. A correlation mask image is generated for selecting pixels of a image before matching. The mask image can be derived from a binary-coded increment sign image defined from any object image and the template imag...
متن کاملRobust Image Registration Using Log-Polar Transform
This paper describes a hierarchical image registration algorithm for affine motion recovery. The algorithm estimates the affine transformation parameters necessary to register any two digital images misaligned due to rotation, scale, shear, and translation. The parameters are computed iteratively in a coarse-to-fine hierarchical framework using a variation of the Levenberg-Marquadt nonlinear le...
متن کاملRobust Optimization Using Disturbance for Image Registration
This paper exploits the different properties between the local neighborhood of global optimum and those of local optima in image registration optimization. Namely, a global optimum has a larger capture neighborhood, in which from any location a monotonic path exists to reach this optimum, than any other local optima. With these properties, we propose a simple and computationally efficient techn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2007
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2007.05.006